|
In mathematics, random groups are certain groups obtained by a probabilistic construction. They were introduced by Misha Gromov to answer questions such as "What does a typical group look like?" It so happens that, once a precise definition is given, random groups satisfy some properties with very high probability, whereas other properties fail with very high probability. For instance, very probably random groups are hyperbolic groups. In this sense, one can say that "most groups are hyperbolic". ==Definition== The definition of random groups depends on a probabilistic model on the set of possible groups. Various such probabilistic models yield different (but related) notions of random groups. Any group can by defined by a group presentation involving generators and relations. For instance, the Abelian group has a presentation with two generators and , and the relation , or equivalently . The main idea of random groups is to start with a fixed number of group generators , and imposing relations of the form where each is a random word involving the letters and their formal inverses . To specify a model of random groups is to specify a precise way in which , and the random relations are chosen. Once the random relations have been chosen, the resulting random group is defined in the standard way for group presentations, namely: is the quotient of the free group with generators , by the normal subgroup generated by the relations seen as elements of : : 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Random group」の詳細全文を読む スポンサード リンク
|